package A1动态规划;

public class LC_583两个字符串的删除操作 {
    public static void main(String[] args){
        String s1="a";
        String s2="a";
        System.out.println(minDistance(s1,s2));
    }
    public static int minDistance(String word1, String word2) {
        int[][] dp=new int[word1.length()+1][word2.length()+1];
        for(int i=0;i<=word1.length();i++)
            dp[i][0]=i;
        for(int j=0;j<=word2.length();j++)
            dp[0][j]=j;
        char[] c1=word1.toCharArray();
        char[] c2=word2.toCharArray();
        for(int i=1;i<=word1.length();i++)
            for(int j=1;j<=word2.length();j++){
                if(c1[i-1]==c2[j-1])
                    dp[i][j]=dp[i-1][j-1];
                else
                    dp[i][j]=Math.min(dp[i-1][j]+1,Math.min(dp[i][j-1]+1,dp[i-1][j-1]+2));
            }
        return dp[word1.length()][word2.length()];
    }
}
